FINITE ELEMENT DIFFERENTIAL FORMS ON CURVILINEAR CUBIC MESHES AND THEIR APPROXIMATION PROPERTIES

Source URL: www.ima.umn.edu

• Tensors
• Operator theory
• Differential forms
• Abstract algebra
• Hilbert space
• Tensor product
• Vector space
• De Rham cohomology
• Pullback
• Algebra
• Mathematics
• Linear algebra

Connections A Computationally Efficient Approximation of Beta Centrality

Source URL: www.insna.org

• Mathematics
• Operations research
• Network analysis
• Algebraic graph theory
• Centrality
• Social network
• Assortativity
• Complex network
• Degree distribution
• Graph theory
• Network theory
• Networks

Circumventing d-to-1 for Approximation Resistance of Satisfiable Predicates Strictly Containing Parity of Width at Least Four

Source URL: theoryofcomputing.org

• Logic in computer science
• Quantum mechanics
• Approximation algorithm
• Combinatory logic
• Reduction
• Parity
• Theoretical computer science
• Physics
• Computational complexity theory

Friday, 16 December[removed]) Speaker: W.M. Schmidt, University of Colorado, Boulder, USA Title : The Number of Solutions of Exponential Equations Friday, 16 December[removed]55) Speaker: M.Mignotte, Unive

Source URL: www.math.tifr.res.in

• Diophantine equations
• Algebraic number theory
• Field theory
• S-unit
• Diophantine approximation
• Transcendental number
• Thue equation
• Transcendence theory
• Equation
• Mathematics
• Number theory
• Abstract algebra

SCOWLP update: 3D classification of protein-protein, -peptide, -saccharide and -nucleic acid interactions, and structure-based binding inferences across folds

Source URL: www.ncbi.nlm.nih.gov

• NP-complete problems
• Tree
• Feedback vertex set
• Approximation algorithm
• Binary tree
• Directed acyclic graph
• Directed graph
• Graph coloring
• Minimum spanning tree
• Graph theory
• Theoretical computer science
• Mathematics

15-854: Approximations Algorithms Topic: Dynamic Programming Scribe: Mihir Kedia

Source URL: www.cs.cmu.edu

• Complexity classes
• Mathematical optimization
• Operations research
• NP-complete problems
• Strongly NP-complete
• Polynomial-time approximation scheme
• Job shop scheduling
• Knapsack problem
• Optimization problem
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

BOOK REVIEWS 206 appeared in the last couple of years concerning the finite element approximation, the few pages devoted to this subject seem to be either superfluous, or completely inadequate even as an introduction to

Source URL: www.ams.org

• Modular forms
• Analytic number theory
• Hecke operator
• Riemann hypothesis
• Eisenstein series
• Cusp form
• Theta function
• Functional equation
• Modular curve
• Mathematical analysis
• Mathematics
• Abstract algebra

84 MATHEMATICS: HARDY AND LITTLEWOOD

Source URL: www.ncbi.nlm.nih.gov

• Diophantine approximation
• Analytic number theory
• Hermann Weyl
• Ergodic theory
• Riemann zeta function
• Transcendental number
• Big O notation
• Equidistribution theorem
• Equidistributed sequence
• Mathematical analysis
• Mathematics
• Number theory

Introduction to Number Theory “Elementary Diophantine Approximation” B.O. Stratmann

Source URL: www.math.uni-bremen.de

BOOK REVIEWS 735 applications in approximation theory. A large part of the book is devoted to the following three central problems. In each case the problem can be posed

Source URL: www.ams.org

• General relativity
• Applied mathematics
• Freeman Dyson
• Gravitation
• Hermann Weyl
• Albert Einstein
• Introduction to special relativity
• Special relativity
• Mathematical physics
• Physics
• Science
• Mathematics